#include "sort.h"

void testInsertSort()
{
    int arr[10] = {9,8,7,6,5,4,3,2,1,0};
    InsertSort(arr,sizeof(arr)/sizeof(arr[0]));
    Print(arr,sizeof(arr)/sizeof(arr[0]));
}

void testShellSort()
{
    
    int arr[10] = {9,8,7,6,5,4,3,2,1,0};
    ShellSort(arr,sizeof(arr)/sizeof(arr[0]));
    Print(arr,sizeof(arr)/sizeof(arr[0]));
}

void testSelectSort()
{
    int arr[10] = {9,8,7,6,5,4,3,2,1,0};
    SelectSort(arr,sizeof(arr)/sizeof(arr[0]));
    Print(arr,sizeof(arr)/sizeof(arr[0]));

}

void testBubbleSort()
{
    int arr[10] = {9,8,7,6,5,4,3,2,1,0};
    BubbleSort(arr,sizeof(arr)/sizeof(arr[0]));
    Print(arr,sizeof(arr)/sizeof(arr[0]));

}

void testHeapSort()
{
    int arr[10] = {9,8,7,6,5,4,3,2,1,0};
    HeapSort(arr,sizeof(arr)/sizeof(arr[0]));
    Print(arr,sizeof(arr)/sizeof(arr[0]));

}

void testQuickSort()
{
    int arr[10] = {9,8,7,6,5,4,3,2,1,0};
    QuickSort2(arr,0,sizeof(arr)/sizeof(arr[0])-1);
    Print(arr,sizeof(arr)/sizeof(arr[0]));

}

void testMergeSort()
{
    int arr[10] = {9,8,7,6,5,4,3,2,1,0};
    MergeSort(arr,sizeof(arr)/sizeof(arr[0]));
    Print(arr,sizeof(arr)/sizeof(arr[0]));
}

void testCountSort()
{
    int arr[10] = {9,8,7,6,5,4,3,2,1,0};
    CountSort(arr,sizeof(arr)/sizeof(arr[0]));
    Print(arr,sizeof(arr)/sizeof(arr[0]));
}

int main()
{
    //testInsertSort();
    //testShellSort();
   //testSelectSort();
     //test0BubbleSort();
    // testHeapSort();
    //testQuickSort();
    //testMergeSort();
    testCountSort();

    return 0;
}
